package LeetCode刷题;

/**
 * @program: Java_Study
 * @author: Xiaofan
 * @createTime: 2021-10-13 15:53
 * @description: Functions of this class is
 * 官方题解：
 * public class Solution {
 *     public boolean canJump(int[] nums) {
 *         int n = nums.length;
 *         int rightmost = 0;
 *         for (int i = 0; i < n; ++i) {
 *             if (i <= rightmost) {
 *                 rightmost = Math.max(rightmost, i + nums[i]);
 *                 if (rightmost >= n - 1) {
 *                     return true;
 *                 }
 *             }
 *         }
 *         return false;
 *     }
 * }
 **/
public class No跳跃游戏 {
    public static void main(String args[]){
    }

}